#include<bits/stdc++.h>

using namespace std;
const int MOD = 1e9 + 7;
long long F[50] = {0, 1, 1};

long long fib(int n) {
    if (n <= 1)return n;
    return fib(n - 1) + fib(n - 2);
}

int main() {
    int n = 46;
    for (int i = 3; i <= n; i++) {
        F[i] = (F[i - 1] + F[i - 2]) % MOD;
    }
    cout << F[n] << endl;

}